A branch and bound algorithm for sector allocation of a naval task group

A naval task group (TG) is a collection of naval combatants and auxiliaries that are grouped together for the accomplishment of one or more missions. Ships forming a TG are located in predefined sectors. We define determination of ship sector locations to provide a robust air defense formation as the sector allocation problem (SAP). A robust formation is one that is very effective against a variety of attack scenarios but not necessarily the most effective against any scenario. We propose a 0‐1 integer linear programming formulation for SAP. The model takes the size and the direction of threat into account as well as the defensive weapons of the naval TG. We develop tight lower and upper bounds by incorporating some valid inequalities and use a branch and bound algorithm to exactly solve SAP. We report computational results that demonstrate the effectiveness of the proposed solution approach. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

空域频域不确定条件下电磁探测卫星规划方法研究

电磁探测卫星对区域目标的覆盖搜索在反恐及海上搜救等领域发挥着重要作用.针对电磁探测卫星区域搜索任务中存在的空域频域不确定性,构建了电磁探测卫星区域搜索问题(EDSASP)中不确定因素的量化描述模型及决策要素模型,提出了基于贝叶斯决策的电磁卫星任务规划方法,并以信息探测收益和前端截获收益为优化目标,建立了空域频域不确定条...     

A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous‐casting production

This article considers the order batching problem in steelmaking and continuous‐casting production. The problem is to jointly specify the slabs needed to satisfy each customer order and group all the slabs of different customer orders into production batches. A novel mixed integer programming model is formulated for the problem. Through relaxing the order assignment constraints, a Lagrangian relaxation model is then obtained. By exploiting the relationship between Lagrangian relaxation and column generation, we develop a combined algorithm that contains nested double loops. At the inner loop, the subgradient method is applied for approximating the Lagrangian dual problem and pricing out columns of the master problem corresponding to the linear dual form of the Lagrangian dual problem. At the outer loop, column generation is employed to solve the master problem exactly and adjust Lagrangian multipliers. Computational experiments are carried out using real data collected from a large steel company, as well as on large‐scaled problem instances randomly generated. The results demonstrate that the combined algorithm can obtain tighter lower bound and higher quality solution within an acceptable computation time as compared to the conventional Lagrangian relaxation algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

从《孙子兵法》管理思想看密切官兵关系的重要性

《孙子兵法》作为兵学圣典,对当前部队的日常管理具有重要的指导作用。从《孙子兵法》对自古以来官兵紧张关系的具体描述,剖析当前官兵关系紧张的成因,探讨科学解决官兵紧张关系的方法。     

论心理咨询在军队思想政治教育中的应用

新形势下军队思想政治教育,不仅要分析官兵思想活动的新情况和新特点,更重要的是需要深入研究官兵心理活动的规律和特点。心理咨询能提升军队思想政治教育效果,促进人的全面发展,实现教育目标。     

《孙子兵法》“五德”思想对现代化武警警官素质修养的借鉴与启迪

古代《孙子兵法》要求为将之道必须具备“智”、“信”、“仁”、“勇”、“严”五德要素。新时期部队指挥员应当借鉴历史经验,努力提高自身素质修养,大力培育部队优良战斗作风,为履行新使命、新职责打下坚实基础。     

浅析军旅影视作品的片名艺术

军旅影视作品的片名是一部影片的开端,片名的好坏直接关系到作品本身的质量。正确理解军旅影视作品片名的意义、命名的方式以及原则,能给军旅影视作品的成功做好铺垫,从某种意义上说,军旅影视作品的片名也是影视艺术的一部分。     

关于Smarandache序列Pd（n）和qd（n）的均值估计

对任意正整数n,Pd（n）定义为n的所有正因子的乘积,gd（n）定义为n的所有小于n的正因子的乘积。若n=p1^a1p2^a2…px^as是n的标准分解式,算数函数Ω（n）=a1＋a2＋…＋as。用解析的方法研究关于Smarandache序列Pd（n）、qd（n）与Q（n）的混合均值,并给出两个较好的渐近公式。     

一种基于球坐标系的四站三维时差定位算法

提出了一种在球坐标系下的无源时差定位算法,该算法解决了参变量法中难于解决的模糊和无解问题,计算量小,定位结果可信。当布站接近平面时,本算法可独立进行定位,当站址高度差较大时本算法可以与参变量法相配合解决模糊和无解问题,适合于工程应用。     

开展军事理论课程教学的思考

军事理论课程教学,在武警部队“合训”院校课程设置中所处的位置越来越重要。如何在由培养工程技术类干部向指挥类干部“学历教育合训”为主的转变过程中,提高军事理论课程讲授的效益和质量,关键在于军事理论课程教学方法的选择与应用。